Parametric Types for Typed Attribute-Value Logic

نویسنده

  • Gerald Penn
چکیده

Parametric polymorphism has been combined with inclusional polymorphism to provide natural type systems for Prolog (DH88), HiLog (YFS92), and cofistraint resolution languages (Smo89), and, in linguistics, by HPSG-tike grammars to classify lists and sets of linguistic objects (PS94), and by phonologists in representations of hierarchical structure (Kle91). This paper summarizes the incorporation of parametric types into the typed attribute-value logic of (Car92), thus providing a natural extension to the type system for ALE (CP96). Following (Car92), the concern here is not with models of feature terms themselves, but with how to compute with parametric types, and what different kinds of information one can represent relative to a signature with parametric types, than relative to a signature without them. This enquiry has yielded a more flexible interpretation of parametric types with several specific properties necessary to conform to their current usage by linguists and implementors who work with feature-based formalisms. 1 M o t i v a t i o n Linguists who avail themselves of attributevalue logic normally choose whether to encode information with subtypes or features on the aesthetic basis of what seems intuitively to capture their generalizations better. Linguists working in LFG typically use one implicit type for objects that bear features, and other types (atoms) for only featureless objects. In HPSG, the si tuation is less clear, both historically (semantic relations, for example, used to be values of a RELN attribute, and are now subtypes of a more general semantic type), and synchronically (verbs, for example, are identified as (un)inverted and (non-)auxiliaries by two boolean-valued features, AUX and INV, whereas their form, e.g., finite, infinitive, gerund, is identified by a subtype of a single vform type). That it makes, or at least should make, no difference from a formal or implementational point of view which encoding is used has been argued elsewhere (Mos96; Pen-f). HPSG's type system also includes parametric types, e.g., Figure 1, from (PS94). In contrast word 7)hrase ~list ~,nelist(X)~ r \ fl I / HEAD:J21 ~ / _ L¢~_. TAIL: l i s t ( X ) si j t X an t i s [ ) . . .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From parametric polymorphism to models of polymorphic FPC

This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...

متن کامل

Strongly Typed Inductive Concept Learning

In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in inductive concept learning and, in particular, illuminates the relationship between attribute-value learning and inductive logic programming (ILP). Individuals are represented by closed terms: tuples of constants in ...

متن کامل

Parametric Polymorphism for Typed Prolog and Prolog

Typed Prolog and Prolog are logic programming languages with a strict typing discipline which is based on simple types with variables. Experiments show that this discipline does not handle properly common logic programming practices used in Prolog. For instance, the usual transformation for computing the Clark completion of a Prolog program does not work well with some typed programs. We observ...

متن کامل

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the type system w.r.t. the execution model: if a program is"well-typed", then all derivations starting in a"well-typed"goal are again"well-typed". It is well-established that without subtyping, this property is readily obtai...

متن کامل

Attribute Global Types for Dynamic Checking of Protocols in Logic-based Multiagent Systems

This paper introduces Attribute Global Types, an extension inspired by Attribute Grammars to a formalism we have recently proposed for specifying and dynamically verifying multi-party agent interaction protocols. Global types equipped with attributes are more expressive, since they allow parametric specifications of protocols, but despite their expressive power, they can be still effectively us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998